Higher - Order ( Non - ) Modularity Claus

نویسندگان

  • VINCENT VAN OOSTROM
  • GRUE SIMONSEN
  • J. G. Simonsen
  • Christopher Lynch
  • J. G. SIMONSEN
چکیده

We show that, contrary to the situation in first-order term rewriting, almost none of the usual properties of rewriting are modular for higher-order rewriting, irrespective of the higher-order rewriting format. We show that for the particular format of simply typed applicative term rewriting systems modularity of confluence, normalization, and termination can be recovered by imposing suitable linearity constraints.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Higher-Order (Non-)Modularity

We show that, contrary to the situation in first-order term rewriting, almostnone of the usual properties of rewriting are modular for higher-order rewriting, irre-spective of the higher-order rewriting format. For the particular format of simply typedapplicative term rewriting systems we prove that modularity of confluence, normalization,and termination can be recovered by impo...

متن کامل

On ‘Parts’ and ‘Wholes’ of Adaptive Behavior: Functional Modularity and Diachronic Structure in Recurrent Neural Robot Controllers

This paper discusses the issue of self-organized modularity for adaptive robot behavior. In particular we introduce the concept of functional modularity through diachronic structure in recurrent neural robot control mechanisms. We demonstrate how behavioral adaptivity through quasi-modularity at a functional level can be realized in monolithic recurrent neurocontrollers through context-dependen...

متن کامل

Mining Overlapping Communities in Real-world Networks Based on Extended Modularity Gain

Detecting communities plays a vital role in studying group level patterns of a social network and it can be helpful in developing several recommendation systems such as movie recommendation, book recommendation, friend recommendation and so on. Most of the community detection algorithms can detect disjoint communities only, but in the real time scenario, a node can be a member of more than one ...

متن کامل

Modularity of the Quasi-interpretations Synthesis and an Application to Higher-Order Programs

Quasi-interpretations have shown their interest to deal with resource analysis of first order functional programs. There are at least two reasons to study the question of modularity of quasi-interpretations. Firstly, modularity allows to decrease the complexity of the quasi-interpretation search algorithms. Secondly, modularity allows to increase the intentionality of the quasi-interpretation m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010